Task Scheduling in an Asynchronous Distributed Memory Multifrontal Solver
نویسندگان
چکیده
منابع مشابه
Task Scheduling in an Asynchronous Distributed Memory Multifrontal Solver
We describe the improvements to the task scheduling for MUMPS, an asynchronous distributed memory direct solver for sparse linear systems. In the new approach, we determine, during the analysis of the matrix, candidate processes for the tasks that will be dynamically scheduled during the following factorization. This approach significantly improves the scalability of the solver in terms of exec...
متن کاملA Fully Asynchronous Multifrontal Solver Using Distributed Dynamic Scheduling
We describe the main features and discuss the tuning of algorithms for the direct solution of sparse linear systems on distributed memory computers developed in the context of PARASOL (ESPRIT IV LTR Project (No 20160)). The algorithms use a multifrontal approach and are especially designed to cover a large class of problems. The problems can be symmetric positive deenite, general symmetric, or ...
متن کاملModeling 1D Distributed-Memory Dense Kernels for an Asynchronous Multifrontal Sparse Solver
To solve sparse linear systems multifrontal methods rely on dense partial LU decompositions of so-called frontal matrices; we consider a parallel, asynchronous setting in which several frontal matrices can be factored simultaneously. In this context, to address performance and scalability issues of acyclic pipelined asynchronous factorization kernels, we study models to revisit properties of le...
متن کاملTask Scheduling for Parallel Multifrontal Methods
We present a new scheduling algorithm for task graphs arising from parallel multifrontal methods for sparse linear systems. This algorithm is based on the theorem proved by Prasanna and Musicus [1] for tree-shaped task graphs, when all tasks exhibit the same degree of parallelism. We propose extended versions of this algorithm to take communication between tasks and memory balancing into accoun...
متن کاملMUltifrontal Massively Parallel Solver
This document describes the Fortran 90 and C user interfaces to MUMPS 4.10.0 We describe in detail the data structures, parameters, calling sequences, and error diagnostics. Basic example programs using MUMPS are also provided. ∗Information on how to obtain updated copies of MUMPS can be obtained from the Web pages http://mumps.enseeiht.fr/ and http://graal.ens-lyon.fr/MUMPS/
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Matrix Analysis and Applications
سال: 2004
ISSN: 0895-4798,1095-7162
DOI: 10.1137/s0895479802419877